منابع مشابه
Universal Commutator Relations, Bogomolov Multipliers, and Commuting Probability
Let G be a finite p-group. We prove that whenever the commuting probability of G is greater than (2p2 + p− 2)/p5, the unramified Brauer group of the field of G-invariant functions is trivial. Equivalently, all relations between commutators in G are consequences of some universal ones. The bound is best possible, and gives a global lower bound of 1/4 for all finite groups. The result is attained...
متن کاملOn the Combinatorics of Crystal Graphs, Ii. the Crystal Commutator
Henriques and Kamnitzer defined a commutator in the category of crystals for complex semisimple Lie algebras based on Lusztig’s involution on a crystal. More recently, Kamnitzer and Tingley proved that the action of this commutator on the highest weight elements (which determines it) is given by Kashiwara’s involution on the Verma crystal. Both of these definitions depend on some maps of crysta...
متن کاملSparse universal graphs
For every n, we describe an explicit construction of a graph on n vertices with at most O(n2− ) edges, for = 0.133 . . ., that contains every graph on n vertices with maximum degree 3 as a subgraph. It is easy to see that each such graph must have at least Ω(n 4 3 ) edges. We also show that the minimum number of edges of a graph that contains every graph with n edges as a subgraph is Θ( n 2 log...
متن کاملK-universal Finite Graphs
This paper investigates the class of k universal nite graphs a local analog of the class of universal graphs which arises naturally in the study of nite variable logics The main results of the paper which are due to Shelah establish that the class of k universal graphs is not de nable by an in nite disjunction of rst order existential sentences with a nite number of variables and that there exi...
متن کاملSome Universal Graphs
It is shown that various classes of graphs have universal elements. In particular, for each n the class of graphs omitting all paths of length n and the class of graphs omitting all circuits of length at least n possess universal elements in all infinite powers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90172-6